Matrix representation for multi-degree reduction of Be'zier curves
نویسنده
چکیده
In this paper, we consider multi-degree reduction of Bézier curves with constraints of endpoints continuity with respect to L2 norm. The control points of the degree reduced Bézier curve can be obtained as a product of the degree reduction matrix and the vector of original control points. We find an explicit form of the multi-degree reduction matrix for Bézier curve with constraints of endpoints continuity. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Degree reduction of disk Be'zier curves
A disk Bézier curve is a Bézier curve whose control points are disks in a plane. It can be viewed as a parametric curve with error tolerances. In this paper, we discuss the problem of degree reduction of disk Bézier curves, that is, bounding disk Bézier curves with lower degree disk Bézier curves. We propose an efficient method to solve this problem. The algorithm starts by finding an optimal a...
متن کاملA unified matrix representation for degree reduction of Bézier curves
In this paper, we show the degree reduction of Bézier curves in a matrix representation. Most degree reduction algorithms have been described as a set of recursive equations which are based on the inverse problem of degree elevation. However, degree elevation can be easily expressed in terms of matrices. Motivated by this observation, we represent most well known degree reduction algorithms in ...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF METACYCLIC 2-GROUPS
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus, every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fa...
متن کاملMultiple Degree Reduction of Interval DP Curves
O. Ismail, Senior Member, IEEE Abstract— Fixed DP curve is a recent representation of the polynomial curves, proposed by Delgado and Pena in 2003. They introduced a new curve representation with linear computational complexity. An algorithmic approach to degree reduction of interval DP curve is presented in this paper. The four fixed Kharitonov's polynomials (four fixed DP curves) associated wi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Aided Geometric Design
دوره 22 شماره
صفحات -
تاریخ انتشار 2005